Algorithm for multiple-symbol differential detection

ABSTRACT

A method for differential phase evaluation of M-ary communication data is employed in which the data consists of N sequential symbols r 1  . . . r N , each having one of M transmitted phases. Selected sequences of N−1 elements that represent possible sequences of phase differentials are evaluated using multiple-symbol differential detection. Using r 1  as the reference for each phase differential estimate, s N−1  phase differential sequences are selected in the form (P 2i , P 3i , . . . , P Ni ) for i=1 to s for evaluating said symbol set, where s is predetermined and 1&lt;s&lt;M. Each set of s phase differential estimate values are chosen based on being the closest in value to the actual transmitted phase differential value. These s phase differential estimates can be determined mathematically as those which produce the maximum results using conventional differential detection.

CROSS REFERENCE TO RELATED APPLICATION(S)

This application is a continuation of U.S. patent application Ser. No. 10/279,238, filed Oct. 24, 2002.

FIELD OF THE INVENTION

This invention relates to differential detection of multiple-phase shift keying (MPSK) modulation in communication systems. This invention generally relates to digital communications, including, but not limited to CDMA systems.

BACKGROUND OF THE INVENTION

Conventionally, communication receivers use two types of MPSK modulated signal detection: coherent detection and differential detection. In coherent detection, a carrier phase reference is detected at the receiver, against which subsequent symbol phases are compared to estimate the actual information phase. Differential detection processes the difference between the received phases of two consecutive symbols to determine the actual phase. The reference phase is the phase of the first of the two consecutive symbols, against which the difference is taken. Although differential detection eliminates the need for carrier phase reference processing in the receiver, it requires a higher signal-to-noise ratio at a given symbol error rate.

Differential detection in an Additive White Gaussian Noise (AWGN) channel is preferred over coherent detection when simplicity of implementation and robustness take precedence over receiver sensitivity performance. Differential detection is also preferred when it is difficult to generate a coherent demodulation reference signal. For differential detection of multiple-phase shift keying (MPSK) modulation, the input phase information is differentially encoded at the transmitter, then demodulation is implemented by comparing the received phase between consecutive symbol intervals. Therefore, for proper operation, the received carrier reference phase should be constant over at least two symbol intervals.

Multiple-symbol differential detection (MSDD) uses more than two consecutive symbols and can provide better error rate performance than conventional differential detection (DD) using only two consecutive symbols. As in the case of DD, MSDD requires that the received carrier reference phase be constant over the consecutive symbol intervals used in the process.

Detailed discussions of MSDD and Multiple Symbol Detection (MSD) are found in, “Multiple-Symbol Differential Detection of MPSK” (Divsalar et al., IEEE TRANSACTIONS ON COMMUNICATIONS, Vol. 38, No. 3, March 1990) and “Multiple-Symbol Detection for Orthogonal Modulation in CDMA System” (Li et al., IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, Vol. 50, No. 1, January 2001).

Conventional MPSK MSDD is explained in conjunction with FIGS. 1 and 2 below. FIG. 1 shows an AWGN communication channel 101 with an MPSK signal sequence r that comprises N consecutive symbols r₁ . . . r_(N) received by receiver 110. Symbol r_(k) represents the k^(th) component of the N length sequence r, where 1≦k≦N.

The value for r_(k) is a vector represented by Equation (1):

$\begin{matrix} {r_{k} = {{\sqrt{\frac{2E_{s}}{T_{s}}}{\mathbb{e}}^{{j\phi}_{k} + {j\theta}_{k}}} + n_{k}}} & {{Eq}.\mspace{14mu}(1)} \end{matrix}$ having symbol energy E_(S), symbol interval T_(S) and transmitted phase φ_(k) where j=√{square root over (−1)}. Value n_(k) is a sample taken from a stationary complex white Gaussian noise process with zero mean. Value θ_(k) is an arbitrary random channel phase shift introduced by the channel and is assumed to be uniformly distributed in the interval (−π, π). Although channel phase shift θ_(k) is unknown, differential detection conventionally operates assuming θ_(k) is constant across the interval of observed symbols r₁ to r_(N). For differential MPSK (DMPSK), phase information is differentially encoded at the transmitter, and transmitted phase φ_(k) is represented by: φ_(k)=φ_(k−1)+Δφ_(k)  Eq. (2) where Δφ_(k) is the transmitted information phase differential corresponding to the k^(th) transmission interval that takes on one of M uniformly distributed values within the set Ω={2πm/M, m=0, 1, . . . , M−1} around the unit circle, as in a Gray mapping scheme. For example, for QPSK, M=4 and Δφ_(k)=0, π/2, π, or 3π/2 for each k from 1 to N.

It is assumed for simplicity that arbitrary phase value θ_(k) is constant (θ_(k)=θ) over the N-length of the observed sequence.

At the receiver, optimum detection using multiple-symbol differential detection (MSDD) is achieved by selecting an estimated sequence of phase differentials {d{circumflex over (φ)}₁, d{circumflex over (φ)}₂, . . . , d{circumflex over (φ)}_(N−1)} which maximizes the following decision statistic:

$\begin{matrix} {\eta = {\max\limits_{{\mathbb{d}{\hat{\phi}}_{1}},{\mathbb{d}{\hat{\phi}}_{2}},\mspace{14mu}\ldots\mspace{14mu},{{\mathbb{d}{\hat{\phi}}_{N - 1}} \in \Omega}}{{r_{1} + {\sum\limits_{m = 2}^{N}\;{r_{m}{\mathbb{e}}^{{- j}{\mathbb{d}{\hat{\phi}}_{m - 1}}}}}}}^{2}}} & {{Eq}.\mspace{14mu}(3)} \end{matrix}$ By Equation (3), the received signal is observed over N symbol time intervals while simultaneously selecting the optimum estimated phase sequence {d{circumflex over (φ)}₁, d{circumflex over (φ)}₂, . . . , d{circumflex over (φ)}_(N−1)}. The maximized vector sum of the N-length signal sequence r_(k), provides the maximum-likelihood detection, where estimated phase differential d{circumflex over (φ)}_(m) is the difference between estimated phase {circumflex over (φ)}_(m+1) and the estimate of the first phase {circumflex over (φ)}₁. d{circumflex over (φ)} _(m)={circumflex over (φ)}_(m+1)−{circumflex over (φ)}₁.  Eq. (4) The estimate of transmitted information phase sequence {Δ{circumflex over (φ)}₁, Δ{circumflex over (φ)}₂, . . . , Δ{circumflex over (φ)}_(N−1)} is obtained from the estimated phase sequence {d{circumflex over (φ)}₁, d{circumflex over (φ)}₂, . . . , d{circumflex over (φ)}_(N−1)} using Equation (5).

$\begin{matrix} {{\mathbb{d}{\hat{\phi}}_{m}} = {\sum\limits_{k = 1}^{m}{\Delta{\hat{\phi}}_{k}}}} & {{Eq}.\mspace{14mu}(5)} \end{matrix}$ Value Δ{circumflex over (φ)}_(k) is an estimate of transmitted phase differential Δφ_(k). Since d{circumflex over (φ)}_(k) (1≦k≦N−1) takes on one of M uniformly distributed Ω values {2πm/M, m=0, 1, . . . , M−1}, the conventional MSDD detection searches all possible phase differential sequences and there are M^(N−1) such phases. The error rate performance improves by increasing the observed sequence length N, which preferably is selected to be N=4 or N=5. As an example, for 16PSK modulation with N=5, the number of phase differential sequences to search is 16⁴=65536. As evident by this considerably large number of sequences, simplicity in the search sequence is sacrificed in order to achieve a desirable error rate performance.

FIG. 2 shows the process flow diagram for algorithm 200, which performs conventional MSDD. It begins with step 201 where N consecutive symbols r_(k) for k=1 to N are observed. Next, the possible sets of phase differential sequences {d{circumflex over (φ)}₁, d{circumflex over (φ)}₂, . . . , d{circumflex over (φ)}_(N−1)} where each d{circumflex over (φ)}_(k), for k=1 to N−1, is one from the set of M uniformly distributed phase values in the set Ω={2πm/M, m=0, 1, . . . , M−1}. There are M^(N−1) possible sets. FIG. 5 shows an example of an array of such sets, where N=4 and M=4, which illustrates the 4⁴⁻¹=64 possible sets of phase differential sequences. In step 203, each possible phase sequence is attempted in the expression

${{r_{1} + {\sum\limits_{m = 2}^{N}\;{r_{m}{\mathbb{e}}^{{- j}{\mathbb{d}{\hat{\phi}}_{m - 1}}}}}}}^{2},$ giving a total of M^(N−1) values. Next, in step 204, the maximum value is found for step 203, which indicates the best estimate phase differential sequence. Finally, in step 205, the final information phase sequence {Δ{circumflex over (φ)}₁, Δ{circumflex over (φ)}₂, . . . , Δ{circumflex over (φ)}_(N−1)} is estimated from {d{circumflex over (φ)}₁, d{circumflex over (φ)}₂, . . . , d{circumflex over (φ)}_(N−1)} using Equation (5) and the information bits are obtained from Gray de-mapping between phase and bits.

Although MSDD provides much better error performance than conventional DD (symbol-by-symbol), MSDD complexity is significantly greater. Therefore, it is desirable to provide an improved method and system for MSDD with less complexity.

SUMMARY

A method for multiple-symbol differential detection phase evaluation of M-ary communication data is employed in which the data consists of N sequential symbols r₁ . . . r_(N), each having one of M transmitted phases. Selected sequences of N−1 elements that represent possible sequences of phase differentials are evaluated using multiple-symbol differential detection. Next, using r₁ as the reference for each phase differential estimate, s^(N−1) phase differential sequences are selected in the form (P_(2i), P_(3i), . . . , P_(Ni)) for i=1 to s for evaluating said symbol set, where s is predetermined and 1<s<M. Rather than attempting every one of the M possible phase differential values during the estimation, the reduced subset of s phase differential estimate values are chosen based on being the closest in value to the actual transmitted phase differential value. These s phase differential estimates can be determined mathematically as those which produce the maximum results in the differential detection expression |r₁+r_(k+1)e^(−jβ) ^(k) |².

Each of the s^(N−1) phase differential sequences are then evaluated using MSDD to determine the final maximum likelihood phase sequence. The resulting final phase sequence can be used to determine the information phase estimates and the phase information bits by Gray de-mapping.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a representation of a channel symbol stream for a receiver.

FIG. 2 shows a process flow diagram of an algorithm 200 for conventional MSDD.

FIG. 3A shows a process flow diagram of an algorithm 300 for reduced complexity MSDD.

FIG. 3B shows a detailed process flow diagram for step 302 of FIG. 3A.

FIGS. 4A, 4B, 4C show a block diagram of an implementation of the reduced complexity MSDD algorithm.

FIG. 5 shows a table of possible phase sequences processed by a conventional MSDD algorithm.

FIG. 6 graphically shows a comparison of the symbol error rate performances for the conventional and simplified MSDD algorithms.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 3A shows a MSDD algorithm 300 that reduces the search complexity of the MSDD of algorithm 200, using a subset search concept. First, instep 301, N consecutive symbols r_(k) are observed for 1≦k≦N−1. In step 302, s^(N−1) sets of phase differential estimate sequences {β₁, β₂, . . . , β_(N−1)} are selected as optimum estimates from among the full set of M^(N−1) phase estimates attempted in algorithm 200. Turning to FIG. 3B, step 302 is broken down in further detail. In step 302A, the initial received signal r₁ is selected as a preferred reference for determining phase differentials between r₁ and each subsequent r_(k). In step 302B, a small candidate subset of s phase differential estimates {β_(k1), β_(k2), . . . β_(ks)} (1≦k≦N−1), among all M possible phases {2πm/M, m=0, 1, . . . , M−1} where 1<s<M and s is predetermined. The s phase estimates that are selected are the closest in value to the actual phase differential Δφ_(k). In order to obtain the closest values for the phase differential estimates, each β_(k) is applied to the conventional DD expression |r₁+r_(k+1)e^(−jβ) ^(k) |² from which the s phase differential estimates {β_(k1), β_(k2), . . . β_(ks)} that produce the maximum resulting value are selected. With the inclusion of this symbol-by-symbol DD process step (302B), it can be seen that algorithm 300 is a combination of MSDD and DD processing. In step 302C, there are now s^(N−1) sets of optimum phase differential sequences, where P_(k)={β_(k1), β_(k2), . . . β_(ks)}. Returning to FIG. 3A, the result of step 302 is s^(N−1) sequences of phases (P₁, P₂, . . . , P_(N−1)). These are the maximum-likelihood phase differential candidates. That is, the s values for P₁ are the closest in value to the actual phase differential Δφ₁, the s values for P₂ are the closest to actual phase differential Δφ₂, and so on.

In step 303, all s^(N−1) possible phase sequences (P₁, P₂, . . . , P_(N−1)) are attempted within the expression

${{r_{1} + {\sum\limits_{m = 2}^{N}\;{r_{m}{\mathbb{e}}^{- {j\beta}_{m - 1}}}}}}^{2}.$ These sets of phase candidates are significantly reduced in number compared with algorithm 200 since s<M and s^(N−1)<M^(N−1). When s is very small, the number of phase differential sequences to search becomes much smaller, which leads to significant complexity savings. As an example, for s=2, N=4 and M=4, there will be eight (8) sets of phase differential sequences that will result. This is a much smaller subset of the sixty-four (64) phase differential sequences shown in FIG. 5, which would be processed in a conventional MSDD algorithm, such as algorithm 200.

In step 304, the maximum resulting vectors from step 303 determine the optimum phase differential sequence {β₁, β₂, . . . , β_(N−1)}. Steps 303 and 304 in combination can be expressed by the following decision statistic:

$\begin{matrix} {\eta^{new} = {\max\limits_{\beta_{1} \in {P_{1,\mspace{14mu}\ldots\mspace{14mu},}\beta_{N - 1}} \in P_{N - 1}}{{r_{1} + {\sum\limits_{m = 2}^{N}\;{r_{m}{\mathbb{e}}^{- {j\beta}_{m - 1}}}}}}^{2}}} & {{Eq}.\mspace{14mu}(6)} \end{matrix}$ When s=M, the statistic is simply η^(new)=η.

In step 305, the final information phase sequence {Δ{circumflex over (φ)}₁, Δ{circumflex over (φ)}₂, . . . Δ{circumflex over ( )}_(N−1)} is estimated from the optimum phase differential sequence {β₁, β₂, . . . β_(N−1)} using Equation (7) and the phase information bits are obtained by Gray de-mapping.

$\begin{matrix} {\beta_{m} = {\sum\limits_{k = 1}^{m}{\Delta{\hat{\phi}}_{k}}}} & {{Eq}.\mspace{14mu}(7)} \end{matrix}$

FIG. 4 shows a block diagram of MSDD parallel implementation 400, where N=4, s=2. Since N=4, there are N−1=3 parallel selection circuits 401, 402, 403, for determining s^(N−1) (i.e., 8) subsets (P₁, P₂, P₃) of candidate phases. Selection circuit 401 comprises delay blocks 410, 411; conjugator 412, multiplier 413, multiplier 415 _(k) (k=0 to N−1), amplitude blocks 416 _(k) (k=0 to N−1), decision block 417 multipliers 418, 419 and switch 450. Input symbol r_(k+3) passes through delays 410, 411 for establishing r_(k) as the reference symbol and r_(k+1) as the consecutive symbol against which the phase differential is to be estimated. The output of conjugator 412 produces conjugate r_(k)*, which when multiplied with consecutive symbol r_(k+1) by multiplier 413, produces a phase difference value. Next, the phase difference is multiplied by multipliers 415 _(k) to each phase in the set β_(k), where β_(k)=(2πk/M, k=0, 1, . . . , M−1). Next, the products are passed through amplitude blocks 415 _(k) and input to decision block 417, which selects the maximum s=2 inputs for the subset P₁=[β_(k1), β_(k2)]. The outputs of block 401 are the products r_(k+1)e^(−jβk1) and r_(k+1)e^(−jβk2) output by multipliers 418, 419.

Decision circuits 402 and 403 comprise parallel sets of similar elements as described for block 401. Decision circuit 402 includes delay blocks 420, 421, which allow processing of reference symbol r_(k) with r_(k+2), whereby decision block 427 chooses candidate phases P₂=[β_(k3), β_(k4)]. Likewise, block 403 includes delay block 431 to allow decision block 437 to select phase differential candidates P₃=[β_(k5), β_(k6)] for reference symbol r_(k) and symbol r_(k+3). Summer 404 adds alternating combinations of outputs from blocks 401, 402 and 403 alternated by switches 450, 451, 452, respectively, plus reference symbol r_(k). Since s=2, there are 2³=8 combinations of phase differential sequence (P₁, P₂, P₃) produced by switches 450, 451, 452. Decision block 405 selects the optimum phase differential sequence {β₁, β₂, β₃}, which is the phase differential sequence (P₁, P₂, P₃) that produces the maximum sum.

FIG. 6 shows the symbol error rate (SER) performance of the MSDD algorithm for 16PSK, where s=2 for different symbol observation lengths N=3, 4 and 5. As shown in FIG. 6, reduced-complexity MSDD algorithm 300 with s=2 provides almost the same performance as the original MSDD algorithm 200 where s=M. This is because the MSDD algorithm 300 selects one of the two closest phases between the vector r_(k+1)e^(−jβ) ^(k) (1≦k≦N−1) and r₁ in order to maximize the statistic of Equation (6). Therefore, for 2<s<M, the performance is essentially the same as for s=2, which means there is no benefit to increasing the complexity of algorithm 300 to s>2. Therefore, the optimum results are gained using the simplest possible choice for s, that is s=2.

Table 1 shows the complexity comparison of algorithm 300 with s=2 for symbol observation length N=5 against algorithm 200. The number of phase differential sequences to search is reduced significantly, resulting in faster processing speeds.

TABLE 1 No. of phase No. of phase differential differential sequences to sequences to Speed search search factor for MSDD 200 for MSDD 300 Reduction (x times M Modulation (M^(N-1)) (S^(N-1)) factor faster) 4 4PSK 256 16 16 12 8 8PSK 4096 16 256 229 16 16PSK 65536 16 4096 3667 

1. A method for multiple-symbol differential detection phase evaluation of MPSK communication data comprising the steps: a) observing a received set of N sequential symbols r₁ to r_(N), each pair of consecutive symbols having a phase differential from among M phases where M>2; b) evaluating the set of symbols r₁ to r_(N) based on selected sequences of N−1 elements that represent possible sequences of phase differentials selected from the set (2πk/M, k=0, 1, . . . , M−1); c) selecting S^(N−1) candidate phase sequences of the form (P_(2i), P_(3i), . . . , P_(Ni)) for i=1 to S for evaluating said symbol set, where 1<S<M, and wherein S candidate phases β_(k1) to β_(ks) of the M phases for each k that are closest to the actual phase differential are selected from the set (2πk/M, k=0, 1, . . . , M−1), which produce the S largest values using the expression |r₁+r_(k+1)e^(−jβ) ^(k) |², resulting in N−1 sets of S phases; d) determining the optimum phase differential sequence from among the candidate phase sequences.
 2. The method of claim 1 wherein evaluating in step (b) further includes estimating a phase differential between the first symbol r₁ and each other symbol r_(k) (k=2 to N); and wherein the determining in step (d) determines an optimum phase differential sequence (β₁, β₂, . . . , β_(N−1)) by attempting the S^(N−1) phase sequences from step (c) in the expression ${{r_{1} + {\sum\limits_{m = 2}^{N}\;{r_{m}{\mathbb{e}}^{- {j\beta}_{m - 1}}}}}}^{2}$ and choosing the phase sequence that produces the maximum result.
 3. The method of claim 2, further comprising: e) determining an estimate of a transmitted information phase differential sequence from the optimum phase differential sequence of step (d); and f) determining phase information bits by Gray de-mapping.
 4. The method of claim 3, wherein step (e) further comprises: calculating the estimate using the relationship $\beta_{m} = {\sum\limits_{k = 1}^{m}{\Delta{\hat{\phi}}_{k}}}$ where β_(m) (m=1 to N−1) represents the optimum phase differential sequence of step (d) and Δ{circumflex over (φ)}_(k) represents estimated the transmitted information phase differential sequence.
 5. The method of claim 2, wherein S=2 and the two closest phases are determined.
 6. The method of claim 2, wherein M=4, N=4 and S=2, said phases β_(k1) to β_(ks) are selected from the set (0, π/2, π, 3π/2), to produce S^(N−1) phase sets: (P₂₁, P₃₁, P₄₁) (P₂₁, P₃₁, P₄₂) (P₂₁, P₃₂, P₄₁) (P₂₁, P₃₂, P₄₂) (P₂₂, P₃₁, P₄₁) (P₂₂, P₃₁, P₄₂) (P₂₂, P₃₂, P₄₁) (P₂₂, P₃₂, P₄₂). 